Trace and Testing Equivalence on Asynchronous Processes

We study trace and may-testing equivalences in the asynchronous versions of CCS and-calculus. We start from the operational deenition of the may-testing preorder and provide for it nitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also touch upon two variants of this theory, by rst considering a more demanding equivalence notion (must-testing) and then a richer version of asynchronous CCS. The results throw light on the diierence between synchronous and asynchronous communication and on the weaker testing power of asynchronous observations. This paper is an extended and revised version of 8] and 9].